Trajectory Planning in Frenet Frame via Multi-Objective Optimization

نویسندگان

چکیده

Autonomous vehicles are an essential tool for promoting the development of intelligent transportation systems (ITS) and can effectively reduce traffic accidents caused by human errors. As important part automatic driving software system, path planning is responsible generating motion trajectory vehicle, which primary factor determining quality. However, solution space construction optimization problem formulation remain challenging research areas in field planning. In this paper, we propose a multi-objective algorithm static obstacle avoidance to improve comfort, safety anti-deviation planned trajectory. We decouple lateral longitudinal vehicle using Frenet frame discretize state generate target states vehicle. Based on initial states, set trajectories quintic quartic polynomials, respectively. addition, design cost function that comprehensively considers safety, deviation distance road center line combining acceleration check, curvature collision check. function, novel method quantify candidate considering size obstacles. The experimental results show proposed quantize paths comfort 13.47%, 32.19%, 59.36% 18.60% straight road, curvy intersection U-shaped Furthermore, 63.72%, 13.86%, 44.36%, 45.56%

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Trajectory Planning Using Multi-objective Genetic Algorithm Optimization

1 Universidade de Trás-os-Montes e Alto Douro, Dep. de Engenharia Electrotécnica, Quinta de Prados, 5000–911 Vila Real, Portugal, {epires,oliveira}@utad.pt, http://www.utad.pt/ ̃epires http://www.utad.pt/ ̃oliveira 2 Instituto Superior de Engenharia do Porto, Dep. de Engenharia Electrotécnica, Rua Dr. António Bernadino de Almeida, 4200-072 Porto, Portugal [email protected], http://www.dee.isep....

متن کامل

Hybrid Multi-Objective Network Planning Optimization Algorithm

In this paper, a novel hybrid algorithm for the optimization of indoor wireless network planning is applied to a polyvalent arts centre. The results of the algorithm are compared with those of a heuristic network planner for three scenarios. Results show that our algorithm is effective for optimization of wireless networks, satisfying maximum coverage, minimal power consumption, minimal cost, a...

متن کامل

Constrained Multi-Objective Trajectory Planning of Parallel Kinematic Machines

This paper presents a new approach to multi-objective dynamic trajectory planning of Parallel Kinematic Machines (PKM) under task, workspace and manipulator constraints. The robot kinematic and dynamic models, (including actuators) are first developed. Then the proposed trajectory planning system is introduced. It minimizes electrical and kinetic energy, robot travel time separating two samplin...

متن کامل

Stochastic multi-objective optimization for aggressive maneuver trajectory planning on loose surface

In this work we regard the problem of trajectory planning for aggressive maneuver of a wheeled mobile robot on loose surface. Our approach is inspired by previously reported analysis of professional rally racers actions during sharp turn. Using numerical simulations we obtain a set of solutions representing all possible compromises between speed and accuracy of maneuver. We choose a particular ...

متن کامل

Rover Trajectory Planning via Simulation Using Incremented Particle Swarm Optimization

This paper presents an off-line optimal trajectory planning for differential-drive rover through simulation of the dynamic model. The paper starts with the model dynamics of an actual rover built in our space science and technology lab (SSTLab) and controlled by simple PD controllers. Next, the proposed optimization technique used is presented which is called Incremented Particle-Swarm Optimiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3294713